Placement goal-based database instance dynamic consolidation

ABSTRACT

Models and tools for facilitating database instance consolidation are described. One approach obtains standardized database instance performance data, receives instance isolation criteria which are applied to divide instances into sets, determines resource usage for each set, and assigns instance sets to target machines based on resource usage and capacity. Each instance set is associated with a virtual machine in some cases. A security isolation criterion indicates that specified instances shall not co-reside on a target machine; an organizational criterion indicates that specified instances shall be located together in a single data center; a compatibility criterion indicates that instances shall not reside in the same virtual machine, the same physical server, or the same server pool. Users iteratively reach an acceptable consolidation of instances at one or more data centers, such as an enhanced assignment of instances that is more efficient than a linear additive solution.

BACKGROUND

A database is a collection of data that is organized to facilitateaccess and updates to the data. Databases can be categorized accordingto the type of data they contain, such as bibliographic, numeric,textual, image, transactional, or other data, for example. Databases canalso be categorized according to the organizational approach used, suchas relational, hierarchical, object-oriented, and hybrid approaches, forexample.

Databases are sometimes instantiated for use in different contexts, suchas a development context in which new functionality is created, apre-production context in which new functionality is tested before thedatabase is released to production, and a production context in whichthe database stores live data and is commercially relied upon, forexample. Databases may also be instantiated multiple times on multipleservers within a given context, to provide faster access and reliabilitythrough redundancy. A given database instance may include databasemanagement software, tables and other data-containing structures,indexes into the data, data access and/or manipulation procedures,memory resources, and other items. A database instance is sometimescalled a database environment.

SUMMARY

Database administrators sometimes want to consolidate databaseinstances, in order to make more efficient use of server hardware and/orfor other reasons. However, instance consolidation may involve tediousand time-consuming manual calculations in an additive linear model, dueto a lack of adequate multi-goal analysis models and tools to derive asolution in which database instances are efficiently consolidated totarget servers as desired.

Some embodiments described herein provide models and tools forfacilitating database instance consolidation. From a tool perspective,one approach involves obtaining standardized database instanceperformance data for database instances running on source machines,receiving at least one database instance isolation criterion from anadministrator, applying the isolation criterion to automatically dividedatabase instances into instance sets, determining a resource usage foreach instance set, and automatically assigning instance sets to targetmachines based on instance set resource usage and target machineresource capacity.

In some embodiments, the isolation criteria may include a SecurityFactor, an Organizational Factor, and/or a Compatibility Factor. Forexample, a security criterion may be present indicating that specifiedinstances shall not co-reside on a target machine, an organizationalcriterion may be present indicating that specified instances shall belocated together in a single data center, and/or a compatibilitycriterion may be present indicating that some instances shall not residein the same virtual machine, the same physical server, or the sameserver pool. Isolation criteria may be applied to guide the solutiontoward an acceptable consolidation of instances at one or multiple datacenters.

In some embodiments, assigning instance sets to target machines mayinvolve dynamic programming and/or combinatorial optimization, such assolving a 0-1 knapsack problem in which target machines are sorted byresource capacity, for example. Each instance set may be associated witha virtual machine, in which case assigning instance sets includesassigning virtual machines to target machines and determining resourceusage includes finding a virtual machine resource usage for each virtualmachine. Determining a resource usage for each instance set may involverounding up to a multiple of a predetermined utilization unit.

From an administrator perspective, some embodiments include placementgoal-based database instance consolidation which involves gatheringdatabase instance performance data for database instances running onsource machines, standardizing the gathered performance data, enteringinto a user interface of a consolidation tool at least one databaseinstance placement goal in the form of at least one isolation criterion,and identifying target machine characteristics to the consolidationtool. The tool may include a suitably programmed spreadsheetapplication, and/or other software. After commanding the consolidationtool to apply database isolation criteria to the standardizedperformance data and the target machine characteristics, theadministrator gets from the tool an “enhanced assignment” of instancesto target machines, namely, an assignment which is more resourceefficient than an additive linear assignment.

In some embodiments, standardizing gathered performance data includesoperations such as the following: setting a Needed Compute Unit to aNormalized CPU Capacity times a Processor Time Percentage; settingNeeded Compute Unit to a Normalized CPU Capacity times a Processor TimePercentage times a multiplier which exceeds one; setting a VirtualMachine Compute Unit to a Target Machine Compute Unit divided by aTarget Machine Number of Processors and times a Virtual Machine Numberof Processors, when Virtual Machine Number of Processors does not exceedTarget Machine Number of Processors; setting a Virtual Machine ComputeUnit to a Target Machine Compute Unit when a Virtual Machine Number ofProcessors exceeds a Target Machine Number of Processors; and/or settinga Virtual Machine Memory Usage based on a Virtual Machine Startup MemoryAllocation and a Virtual Machine Maximum Memory Allocation.

In some embodiments, an assignment of instances is gotten by theadministrator from the consolidation tool for at least one of thefollowing situations: source machines are treated as being located inmultiple data centers and target machines are treated as being locatedin multiple data centers; source machines are treated as being locatedin multiple data centers and target machines are treated as beinglocated in a single data center; source machines are treated as beinglocated in a single data center and target machines are treated as beinglocated in multiple data centers; source machines are treated as beinglocated in a single data center and target machines are treated as beinglocated in a single data center.

From an architectural perspective, some embodiments are configured toassist database instance consolidation using a logical processor, amemory in operable communication with the logical processor, databaseinstance isolation criteria residing in the memory, and databaseinstance consolidation code residing in the memory. The consolidationcode is capable of automatically applying the isolation criterion todivide instances into instance sets, and is also capable ofautomatically assigning instance sets to target machines based oninstance set resource usage and target machine resource capacity.Standardized database instance performance data may also reside in thememory, and the consolidation code may be capable of determining aresource usage for each instance set based on the performance data. Theconsolidation code produces in the memory an enhanced assignment ofinstances to target machines, which is more resource efficient than anadditive linear assignment.

In some embodiments, the database instance consolidation code includes aspreadsheet program which is programmed to automatically assign instancesets to target machines based on instance set resource usage and targetmachine resource capacity. In some, the consolidation code is programmedto assign instance sets to target machines based on a solution of a 0-1knapsack problem arising from the instance sets.

The examples given are merely illustrative. This Summary is not intendedto identify key features or essential features of the claimed subjectmatter, nor is it intended to be used to limit the scope of the claimedsubject matter. Rather, this Summary is provided to introduce—in asimplified form—some concepts that are further described below in theDetailed Description. The innovation is defined with claims, and to theextent this Summary conflicts with the claims, the claims shouldprevail.

DESCRIPTION OF THE DRAWINGS

A more particular description will be given with reference to theattached drawings. These drawings only illustrate selected aspects andthus do not fully determine coverage or scope.

FIG. 1 is a block diagram illustrating a computer system having at leastone processor, at least one memory, at least one application, and otheritems in an operating environment which may be present on multiplenetwork nodes, and also illustrating configured storage mediumembodiments;

FIG. 2 is a block diagram illustrating some architectural aspects ofplacement goal-based database instance consolidation in someembodiments;

FIG. 3 is a low-level flow chart illustrating steps of some process andconfigured storage medium embodiments;

FIG. 4 is a high-level flow chart illustrating steps of some process andconfigured storage medium embodiments;

FIG. 5 is a data flow diagram illustrating placement goal-based databaseinstance consolidation in some embodiments; and

FIG. 6 is a flow chart illustrating steps of some process and configuredstorage medium embodiments for a placement goal-based database instanceconsolidation which targets a single data center.

DETAILED DESCRIPTION Overview

Database instance consolidation may be a significant issue in variouscontexts. For example, changes in data center allocations, efforts toutilize cloud computing for database applications, and other enterpriseactivities may involve instance consolidation. A “one workload, one box”approach to server provisioning for database instances has often led toover-provisioning and underutilization of hardware assets. Whenutilization of servers in a data center is low, a large percentage ofresources are idle, which in turn leads to increased cost of resourcessuch as space, heating and cooling, and network infrastructure. In suchcases, benefits may be available through virtualization of the datacenter, and consolidation of databases.

However, difficult challenges may hinder consolidation, particularly forlarge enterprises. In some situations, tedious and time-consumingcalculation has been performed manually in a familiar effort to derive asolution specifying which database instances will be consolidated towhich target servers, due to the lack of adequate analysis andcalculation models and tools. But a single-goal simple compute modelsolution, in which calculations adhere to an additive linear model witha single goal, can be hard to reach. An additive linear approach oftenfails to reach an optimal consolidation solution, especially for anenterprise with dozens of servers.

In some familiar approaches, for example, a Database Administrator (DBA)working on a consolidation plan will manually arrange database instancesby tentatively assigning them to a set of target servers based on majorresource utilizations in candidate host servers. But this tentativearrangement is based on an additive linear model, making it difficult toreach an optimal solution. If the tentative assignment also fails toround up values in response to commercial hardware features, such as a9-core CPU, significant waste may continue even after consolidation.

Some embodiments described herein use dynamic programming and/or othermathematical models, instead of the familiar linear model, to inform theimplementation of database consolidation tools and techniques. Despitetheir underlying sophistication, some of these tool embodiments providea relatively simple interface which allows general technical staffpersonnel (as opposed to experienced DBAs, for example) to effectivelyuse the tool to aid database consolidation and to reduce the effort ofdatabase instance consolidation. Some embodiments provide a goal-basedcalculation model for enterprise-level customers, to help themconsolidate their on-premises database instances to cloud or physicalserver pools.

In some embodiments, an analysis and calculation model is used whichallows users to reach an optimal solution for a goal-based databaseinstance consolidation from an on-premise platform to a cloud platform.In some, a placement-goal-based mathematical model is implemented bothfor consolidation to a single data center and for consolidation tomultiple data centers. Some embodiments transform inputs such asdatabase consolidation factors, performance data, and machine andresource characteristics into a 0-1 knapsack problem, such that familiaralgorithms can then be applied to consolidate database instances in asingle data center situation. Some embodiments transform the inputs suchthat dynamic programming can be applied to consolidate databaseinstances for multiple data centers.

Some embodiments described herein may be viewed in a broader context.For instance, concepts such as standardization, performance data,isolation, instances, resource usage, and assignment may be relevant toa particular embodiment. However, it does not follow from theavailability of a broad context that exclusive rights are being soughtherein for abstract ideas; they are not. Rather, the present disclosureis focused on providing appropriately specific embodiments. Other media,systems, and processes involving standardization, performance data,isolation, instances, resource usage, and assignment are outside thepresent scope. Accordingly, vagueness and accompanying proof problemsare also avoided under a proper understanding of the present disclosure.

Reference will now be made to exemplary embodiments such as thoseillustrated in the drawings, and specific language will be used hereinto describe the same. But alterations and further modifications of thefeatures illustrated herein, and additional applications of theprinciples illustrated herein, which would occur to one skilled in therelevant art(s) and having possession of this disclosure, should beconsidered within the scope of the claims.

The meaning of terms is clarified in this disclosure, so the claimsshould be read with careful attention to these clarifications. Specificexamples are given, but those of skill in the relevant art(s) willunderstand that other examples may also fall within the meaning of theterms used, and within the scope of one or more claims. Terms do notnecessarily have the same meaning here that they have in general usage,in the usage of a particular industry, or in a particular dictionary orset of dictionaries. Reference numerals may be used with variousphrasings, to help show the breadth of a term. Omission of a referencenumeral from a given piece of text does not necessarily mean that thecontent of a Figure is not being discussed by the text. The inventorsassert and exercise their right to their own lexicography. Terms may bedefined, either explicitly or implicitly, here in the DetailedDescription and/or elsewhere in the application file.

As used herein, a “computer system” may include, for example, one ormore servers, motherboards, processing nodes, personal computers(portable or not), personal digital assistants, cell or mobile phones,other mobile devices having at least a processor and a memory, and/orother device(s) providing one or more processors controlled at least inpart by instructions. The instructions may be in the form of firmware orother software in memory and/or specialized circuitry. In particular,although it may occur that many embodiments run on workstation or laptopcomputers, other embodiments may run on other computing devices, and anyone or more such devices may be part of a given embodiment.

A “multithreaded” computer system is a computer system which supportsmultiple execution threads. The term “thread” should be understood toinclude any code capable of or subject to synchronization, and may alsobe known by another name, such as “task,” “process,” or “coroutine,” forexample. The threads may run in parallel, in sequence, or in acombination of parallel execution (e.g., multiprocessing) and sequentialexecution (e.g., time-sliced). Multithreaded environments have beendesigned in various configurations. Execution threads may run inparallel, or threads may be organized for parallel execution butactually take turns executing in sequence. Multithreading may beimplemented, for example, by running different threads on differentcores in a multiprocessing environment, by time-slicing differentthreads on a single processor core, or by some combination oftime-sliced and multi-processor threading. Thread context switches maybe initiated, for example, by a kernel's thread scheduler, by user-spacesignals, or by a combination of user-space and kernel operations.Threads may take turns operating on shared data, or each thread mayoperate on its own data, for example.

A “logical processor” or “processor” is a single independent hardwarethread-processing unit. For example a hyperthreaded quad core chiprunning two threads per core has eight logical processors. Processorsmay be general purpose, or they may be tailored for specific uses suchas graphics processing, signal processing, floating-point arithmeticprocessing, encryption, I/O processing, and so on.

A “multiprocessor” computer system is a computer system which hasmultiple logical processors. Multiprocessor environments occur invarious configurations. In a given configuration, all of the processorsmay be functionally equal, whereas in another configuration someprocessors may differ from other processors by virtue of havingdifferent hardware capabilities, different software assignments, orboth. Depending on the configuration, processors may be tightly coupledto each other on a single bus, or they may be loosely coupled. In someconfigurations the processors share a central memory, in some they eachhave their own local memory, and in some configurations both shared andlocal memories are present.

“Kernels” include operating systems, hypervisors, virtual machines, BIOScode, and similar hardware interface software.

“Code” means processor instructions, data (which includes constants,variables, and data structures), or both instructions and data.

“Program” is used broadly herein, to include applications, kernels,drivers, interrupt handlers, libraries, scripts, macros, and other codewritten by programmers (who are also referred to as developers).

“Automatically” means by use of automation (e.g., general purposecomputing hardware configured by software for specific operationsdiscussed herein), as opposed to without automation. In particular,steps performed “automatically” are not performed by hand on paper or ina person's mind; they are performed with a machine. However,“automatically” does not necessarily mean “immediately”.

Throughout this document, use of the optional plural “(s)” means thatone or more of the indicated feature is present. For example,“machine(s)” means “one or more machines” or equivalently “at least onemachine”.

Throughout this document, unless expressly stated otherwise anyreference to a step in a process presumes that the step may be performeddirectly by a party of interest and/or performed indirectly by the partythrough intervening mechanisms and/or intervening entities, and stilllie within the scope of the step. That is, direct performance of thestep by the party of interest is not required unless direct performanceis an expressly stated requirement. For example, a step involving actionby a party of interest such as “obtaining”, “receiving”, “applying”,“assigning”, “dividing”, “accessing”, “viewing”, “deriving”,“displaying”, “collecting”, “transmitting”, “sending”, “issuing”, or“communicating” with regard to a destination or other subject mayinvolve intervening action such as forwarding, copying, uploading,downloading, encoding, decoding, compressing, decompressing, encrypting,decrypting, authenticating, invoking, and so on by some other party, yetstill be understood as being performed directly by the party ofinterest.

Whenever reference is made to data or instructions, it is understoodthat these items configure a computer-readable memory therebytransforming it to a particular article, as opposed to simply existingon paper, in a person's mind, or as a transitory signal on a wire, forexample.

Operating Environments

With reference to FIG. 1, an operating environment 100 for an embodimentmay include a computer system 102. The computer system 102 may be amultiprocessor computer system, or not. An operating environment mayinclude one or more machines in a given computer system, which may beclustered, client-server networked, and/or peer-to-peer networked. Anindividual machine is a computer system, and a group of cooperatingmachines is also a computer system. A given computer system 102 may beconfigured for end-users, e.g., with applications, for administrators,as a server, as a distributed processing node, and/or in other ways.

Human users 104 may interact with the computer system 102 by usingdisplays, keyboards, and other peripherals 106. System/networkadministrators, database administrators (DBAs), developers, engineers,customers, and other end-users are each a particular type of user 104.Automated agents acting on behalf of one or more people may also beusers 104. Storage devices and/or networking devices may be consideredperipheral equipment in some embodiments. Other computer systems notshown in FIG. 1 may interact with the computer system 102 or withanother system embodiment using one or more connections to a network 108via network interface equipment, for example.

The computer system 102 includes at least one logical processor 110. Thecomputer system 102, like other suitable systems, also includes one ormore computer-readable non-transitory storage media 112. Media 112 maybe of different physical types. The media 112 may be volatile memory,non-volatile memory, fixed in place media, removable media, magneticmedia, optical media, and/or of other types of non-transitory media (asopposed to transitory media such as a wire that merely propagates asignal). In particular, a configured medium 114 such as a CD, DVD,memory stick, or other removable non-volatile memory medium may becomefunctionally part of the computer system when inserted or otherwiseinstalled, making its content accessible for use by processor 110. Theremovable configured medium 114 is an example of a computer-readablestorage medium 112. Some other examples of computer-readable storagemedia 112 include built-in RAM, ROM, hard disks, and other storagedevices which are not readily removable by users 104.

The medium 114 is configured with instructions 116 that are executableby a processor 110; “executable” is used in a broad sense herein toinclude machine code, interpretable code, and code that runs on avirtual machine, for example. The medium 114 is also configured withdata 118 which is created, modified, referenced, and/or otherwise usedby execution of the instructions 116. The instructions 116 and the data118 configure the medium 114 in which they reside; when that memory is afunctional part of a given computer system, the instructions 116 anddata 118 also configure that computer system. In some embodiments, aportion of the data 118 is representative of real-world items such asproduct characteristics, inventories, physical measurements, settings,images, readings, targets, volumes, and so forth. Such data is alsotransformed by instance consolidation analysis as discussed herein,e.g., by standardizing, applying, dividing, assigning, rounding up,sorting, optimizing, solving, associating, binding, deployment,execution, modification, display, creation, loading, and/or otheroperations.

In addition to processor(s) 110 and memory 112, an operating environmentmay also include other hardware, such as displays, buses, powersupplies, and accelerators, for instance.

Applications 120 such as a word processor 122 and spreadsheet 124, othersoftware, and some other items shown in the Figures and/or discussed inthe text may reside partially or entirely within one or more media 112,thereby configuring those media. A current configuration 126 descriptionin a file or other data structure may be present, describing aspects ofa current database instance configuration, such as which instancespresently run on which servers. The database servers may becharacterized and identified as source machines 128 for purposes of aconsolidation effort. As part of a consolidation effort, data about theperformance (utilization, efficiency, resource needs, latency,transaction loads, and so on) of the source machines may be gathered bya profiler 130. A proposed consolidation in the form of an additivelinear assignment 132 of instances to machines, produced using familiarmethods, may also be present.

One or more items are shown in outline form in FIG. 1 to emphasize thatthey are not necessarily part of the illustrated operating environment,but may interoperate with items in the operating environment asdiscussed herein. It does not follow that items not in outline form arenecessarily required, in any Figure or any embodiment.

Systems

FIG. 2 illustrates aspects of an architecture which is suitable for usewith some embodiments. A database instance consolidation tool 202 has auser interface 204, and has an engine or other code 206 which analyzesdata and produces consolidation suggestions. Inputs to thisconsolidation tool 202 include information about database instances 208,such as their performance data 210, their current source machine 128locations, and their resource usage 212, for example. Database“instance” performance data does not necessarily distinguish betweendatabase instances; some embodiments (system or process) use performancedata which summarizes performance and resource usage at the machinelevel for all database instance(s) running on a given machine. Theconsolidation tool 202 is also given one or more isolation criteria 214,in the form of default analyses, numeric factors 216, or both. Theconsolidation tool 202 also has data about target machines 218, targetdata center(s) 220, and their resource capacities 222, e.g., processingpower, available memory, and/or other resources deemed pertinent.Resources may be analyzed in terms of virtual machines 224 which arethen mapped to physical machines, possibly by way of a cloud computingmanagement service.

In some embodiments, the consolidation tool 202 takes the inputs anddivides the instances 208 into sets 226. Then the consolidation tool 202uses approaches such as combinatorial optimization, dynamic programming,and/or transformation of inputs into a 0-1 knapsack problem 228, togenerate a solution 230 which can be formatted to give the user anenhanced assignment 232 of database instances to target machines 218 anddata center(s) 220.

With reference to FIGS. 1 and 2, some embodiments provide a computersystem 102 with a logical processor 110 and a memory medium 112configured by circuitry, firmware, and/or software to transform dataabout source machines, target machines, and database instances bygoal-driven instance consolidation analysis and placement suggestiongeneration as described herein.

In some embodiments, a computer system 102 configured to assist databaseinstance consolidation includes a logical processor 110, a memory 112 inoperable communication with the logical processor, at least one databaseinstance isolation criterion 214 residing in the memory, and databaseinstance consolidation code 206 residing in the memory. Theconsolidation code 206 is capable of automatically applying the databaseisolation criterion to divide database instances 208 into instance sets226. The code 206 is also capable of automatically assigning instancesets to target machines 218 based on instance set resource usage 212 andtarget machine resource capacity 222.

In some embodiments, the system 102 is further characterized bystandardized database instance performance data 210 residing in thememory. In some, the database instance consolidation code 206 is alsocapable of determining a resource usage 212 for each instance set 226based on the performance data 210.

In some embodiments, the database instance consolidation code 206includes a spreadsheet 124 with certain programming. Specifically, thespreadsheet program is programmed to automatically assign instance sets226 to target machines 218 based on instance set resource usage 212 andtarget machine resource capacity 222.

In some embodiments, the database instance consolidation code 206 isprogrammed to assign instance sets 226 to target machines 218 based atleast in part on a solution 230 of a 0-1 knapsack problem 228; the 0-1knapsack problem 228 arises at least in part from the instance sets 226.

In some embodiments, the system 102 is characterized in that an enhancedassignment 232 of instances 208 to target machines 218 resides in thememory. As used herein, an “enhanced assignment” is an assignment whichis more resource efficient than an additive linear assignment.

In some embodiments peripherals 106 such as human user I/O devices(screen, keyboard, mouse, tablet, microphone, speaker, motion sensor,etc.) will be present in operable communication with one or moreprocessors 110 and memory. However, an embodiment may also be deeplyembedded in a system, such that no human user 104 interacts directlywith the embodiment. Software processes may be users 104.

In some embodiments, the system includes multiple computers connected bya network. Networking interface equipment can provide access to networks108, using components such as a packet-switched network interface card,a wireless transceiver, or a telephone network interface, for example,will be present in a computer system. However, an embodiment may alsocommunicate through direct memory access, removable nonvolatile media,or other information storage-retrieval and/or transmission approaches,or an embodiment in a computer system may operate without communicatingwith other computer systems.

Some embodiments operate in a “cloud” computing environment and/or a“cloud” storage environment in which computing services are not ownedbut are provided on demand. For example, consolidation tool code 206 maybe on multiple devices/systems 102 in a networked cloud, performancedata 210 may be stored on yet other devices within the cloud, and theenhanced assignment 232 may configure the display on yet other clouddevice(s)/system(s) 102.

Processes

FIG. 3 illustrates some process embodiments in a flowchart 300.Processes shown in the Figures may be performed in some embodimentsautomatically, e.g., by a consolidation tool 202 driven by data 210,criteria 214, and other information provided under control of a scriptor otherwise requiring little or no contemporaneous user input.Processes may also be performed in part automatically and in partmanually unless otherwise indicated. In a given embodiment zero or moreillustrated steps of a process may be repeated, perhaps with differentparameters or data to operate on. Steps in an embodiment may also bedone in a different order than the top-to-bottom order that is laid outin FIG. 3. Steps may be performed serially, in a partially overlappingmanner, or fully in parallel. The order in which flowchart 300 istraversed to indicate the steps performed during a process may vary fromone performance of the process to another performance of the process.The flowchart traversal order may also vary from one process embodimentto another process embodiment. Steps may also be omitted, combined,renamed, regrouped, or otherwise depart from the illustrated flow,provided that the process performed is operable and conforms to at leastone claim.

Examples are provided herein to help illustrate aspects of thetechnology, but the examples given within this document do not describeall possible embodiments. Embodiments are not limited to the specificimplementations, arrangements, displays, features, approaches, orscenarios provided herein. A given embodiment may include additional ordifferent features, mechanisms, and/or data structures, for instance,and may otherwise depart from the examples provided herein.

During a performance data gathering step 302, a user (or an embodimentoperating on behalf of a user) gathers performance data 210 aboutdatabase instances. Step 302 may be accomplished using a profiler 130 orother mechanism, for example.

During a performance data obtaining step 304, an embodiment obtainsperformance data 210 about database instances. Data obtaining step 304corresponds generally with data gathering step 302, except that step 302is from a user perspective and step 304 is from a consolidation toolperspective. Step 304 may be accomplished by automatically invoking aprofiler 130, by receiving the storage location of previously gathered302 data 210, or by other mechanisms, for example.

During a performance data standardizing step 306, an embodiment or auser standardizes performance data 210 about database instances. Step306 may be accomplished by normalizing resource information intopredefined standard units, for resources such as CPU (a.k.a. processor)and memory.

During a setting step 308 which may be part of standardizing step 306,for example, a value may be set for a standard unit such as a physicalmachine's compute unit 310, a virtual machine's compute unit 312, or amachine's (physical or virtual) memory usage 314. Although some standardunits may prove to be more convenient as a practical matter, a varietyof standard units may be present in a given group of embodiments;standardization per se is more a focus of this step than any particularchoice of standard unit.

During a particular isolation criterion type using step 316, anembodiment (or a user manipulating aspects of an embodiment) uses aparticular type of isolation criterion 214, such as a security isolationcriterion 214, 318 or an organizational isolation criterion 214, 320.For example, the criterion may be used by supplying it to aconsolidation tool 202 or by applying it within a consolidation tool 202to produce an enhanced assignment.

More generally, during an isolation criterion entering step 322, a userenters an isolation criterion 214 into a consolidation tool 202 userinterface 204. During an isolation criterion receiving step 324, aconsolidation tool 202 receives an isolation criterion 214 through itsuser interface 204. Keyboards, Graphical User Interfaces (GUIs), networktransmissions, scripts, file reads, and other familiar mechanisms forentering/receiving values in a piece of software may be used.

During a target machine identifying step 326, a user identifies targetmachine characteristics to a consolidation tool 202. Suchcharacteristics may include, for example, target machine resourcecapacity 222, target machine location by data center, andcharacteristics related to isolation criteria 214.

During a consolidation tool commanding step 328, a user commands aconsolidation tool 202 to apply the information it has been given andprovide a consolidation suggestion. Familiar user interface commandmechanisms can be used.

During an information applying step 330, a consolidation tool 202applies the isolation criteria 214 and other information it has beengiven, in an attempt to generate a consolidation suggestion, usingdynamic programming, combinatorial optimization, and/or other mechanismsdescribed herein.

During an instances dividing step 332, which may be part of applyingstep 330, an embodiment divides instances 208 into sets 226, bypartitioning the instances according to isolation criteria 214 asdescribed herein.

During a resource usage determining step 334, an embodiment determines arespective resource usage 212 for each instance set 226, based onperformance data 210, but in view of standardization 306, and possiblyalso rounding up 336.

During a rounding up step 336, an embodiment rounds up resource values,based on information about target machines 218, such as by rounding upto reflect the number of processor cores on a multi-core server.

During a sorting step 338, an embodiment sorts machines by theirrespective resource capacity 222. Any familiar sorting mechanism (bubblesort, insertion sort, quick sort, etc.) may be used in a givenembodiment.

During a dynamic programming utilizing step 340, an embodiment usesdynamic programming 342 (as opposed to mere additive linearcalculations) to generate a database instance consolidation suggestion.

During a combinatorial optimization utilizing step 344, an embodimentuses combinatorial optimization 346 (as opposed to mere additive linearcalculations) to generate a database instance consolidation suggestion.

During a set-to-VM associating step 348, an embodiment associates aninstance set 226 with a virtual machine 224, while generating a databaseinstance consolidation suggestion.

During an instance set assigning step 350, an embodiment assignsinstance sets 226 to target machines 218 as part of a database instanceconsolidation suggestion. If the consolidation suggestion issufficiently efficient, it can then be presented in a formatted manner(e.g., printed or otherwise displayed table or list) to a user as anenhanced assignment 232.

During a VM-to-target assigning step 352, an embodiment assigns virtualmachines 224 to target machines 218 as part of a database instanceconsolidation suggestion.

During a VM resource usages finding step 354, an embodiment findsvalue(s) for CPU. Memory, and/or other resource usage(s) of virtualmachines 224, based on inputs provided by a user, a data file,programmed defaults, and/or other source.

During a machine location treating step 356, an embodiment treatsspecified machine(s), such as source machines 128 and/or target machines218, as being located in one data center or multiple data centers,according to isolation criteria 214 received.

During a knapsack problem solving step 358, an embodiment solves a 0-1knapsack problem 228, using familiar techniques for solving suchproblems.

During an enhanced assignment getting step 360, a user gets from aconsolidation tool 202 an enhanced assignment 232 or other suggestion362 for consolidating database instances to target machines 218.

The foregoing steps and their interrelationships are discussed ingreater detail below, and elsewhere herein, in connection with variousembodiments.

From a tool perspective, some embodiments provide a process forfacilitating database instance consolidation. The process includesobtaining 304 standardized database instance performance data 210 fordatabase instances 208 running on source machines 128, receiving 324 atleast one database instance isolation criterion 214, applying 330 atleast one received database isolation criterion to automatically divide332 database instances into instance sets 226, determining 334 aresource usage 212 for each instance set (which may include rounding up336 to a multiple of a predetermined utilization unit), andautomatically assigning 350 instance sets to target machines based oninstance set resource usage and target machine resource capacity.Assignment 350 may include sorting 338 target machines by resourcecapacity, may utilize 340/344 dynamic programming 342 and/orcombinatorial optimization 346, and may involve solving 358 a 0-1knapsack problem 228.

In some embodiments, at least one of the following is received as anisolation criterion 214: a security isolation criterion 318 indicatingthat specified instances shall not co-reside on a target machine, anorganizational isolation criterion 320 indicating that specifiedinstances shall be located together in a single data center.

In some embodiments, the process associates 348 each instance set 226with a virtual machine 224, and assigning 350 instance sets includesassigning 352 virtual machines 224 to target machines 218. In some,determining 334 a resource usage for each instance set includes finding354 a virtual machine resource usage 212 for each virtual machine.

From a user perspective, some embodiments provide a process forplacement goal-based database instance consolidation. The processincludes gathering 302 database instance performance data 210 fordatabase instances 208 running on source machines 128, standardizing 306gathered performance data, entering 322 into a user interface of aconsolidation tool 202 at least one database instance placement goal inthe form of at least one isolation criterion 214, identifying 326 targetmachine characteristics to the consolidation tool, commanding 328 theconsolidation tool to apply one or more database isolation criteria tothe standardized performance data and the target machinecharacteristics, and getting 360 from the consolidation tool an enhancedassignment 232 of instances to target machines (an assignment which ismore resource efficient than an additive linear assignment). Steps maybe assisted by tools, such as profilers 130, spreadsheets 124, and othersoftware.

In some embodiments, standardizing 306 gathered performance dataincludes at least one of the following: setting 308 a Needed ComputeUnit 310 to a Normalized CPU Capacity times a Processor Time Percentage,setting 308 a Needed Compute Unit 310 to a Normalized CPU Capacity timesa Processor Time Percentage times a multiplier which exceeds one,setting 308 a Virtual Machine Compute Unit 312 to a Target MachineCompute Unit divided by a Target Machine Number of Processors and timesa Virtual Machine Number of Processors when Virtual Machine Number ofProcessors does not exceed Target Machine Number of Processors, setting308 a Virtual Machine Compute Unit 312 to a Target Machine Compute Unitwhen a Virtual Machine Number of Processors exceeds a Target MachineNumber of Processors, setting 308 a Virtual Machine Memory Usage 314based on a Virtual Machine Startup Memory Allocation and a VirtualMachine Maximum Memory Allocation.

In some embodiments, entering 322 includes entering at least oneisolation criterion 214 into a spreadsheet program, and the spreadsheetprogram serves as at least a portion of the user interface 204 of theconsolidation tool 202; programming in the spreadsheet 124 may alsoserve as at least a portion of the consolidation code 206 that analyzesinputs and provides enhanced assignments 232.

In some embodiments, the code 206 treats 356 machines in specified waysas to data center location. For example, in some cases users get 360 anassignment of instances for at least one of the following situations:source machines are treated 356 as being located in multiple datacenters and target machines are treated 356 as being located in multipledata centers, source machines are treated 356 as being located inmultiple data centers and target machines are treated 356 as beinglocated in a single data center, source machines are treated 356 asbeing located in a single data center and target machines are treated356 as being located in multiple data centers, source machines aretreated 356 as being located in a single data center and target machinesare treated 356 as being located in a single data center.

In some embodiments, a user enters 322 (and the tool thus receives 324)at least one isolation criterion 214 which is based on at least one ofthe following: a Security Factor 216, an Organizational Factor 216, aCompatibility Factor 216. In particular, a user may enter 322 a SecurityFactor 216 or other security isolation criterion 318 which indicatesthat specified instances 208 shall not co-reside on a target machine218. A user may also enter 322 an Organizational Factor 216 or otherorganizational isolation criterion 320 which indicates that specifiedinstances 208 shall be located together in a single data center.

Configured Media

Some embodiments include a configured computer-readable storage medium112. Medium 112 may include disks (magnetic, optical, or otherwise),RAM, EEPROMS or other ROMs, and/or other configurable memory, includingin particular non-transitory computer-readable media (as opposed towires and other propagated signal media). The storage medium which isconfigured may be in particular a removable storage medium 114 such as aCD, DVD, or flash memory. A general-purpose memory, which may beremovable or not, and may be volatile or not, can be configured into anembodiment using items such as consolidation tools 202, isolationcriteria 214, and enhanced assignments 232, in the form of data 118 andinstructions 116, read from a removable medium 114 and/or another sourcesuch as a network connection, to form a configured medium. Theconfigured medium 112 is capable of causing a computer system to performprocess steps for transforming data through analysis of inputs andgeneration of suggestions 362 for database instance consolidation asdisclosed herein. FIGS. 1 through 3 (and other Figures discussed below)thus help illustrate configured storage media embodiments and processembodiments, as well as system and process embodiments. In particular,any of the process steps illustrated in FIG. 3, or otherwise taughtherein, may be used to help configure a storage medium to form aconfigured medium embodiment.

Additional Examples

Additional details and design considerations are provided below. As withthe other examples herein, the features described may be usedindividually and/or in combination, or not at all, in a givenembodiment.

Those of skill will understand that implementation details may pertainto specific code, such as specific APIs and specific sample programs,and thus need not appear in every embodiment. Those of skill will alsounderstand that program identifiers and some other terminology used indiscussing details are implementation-specific and thus need not pertainto every embodiment. Nonetheless, although they are not necessarilyrequired to be present here, these details are provided because they mayhelp some readers by providing context and/or may illustrate a few ofthe many possible implementations of the technology discussed herein.

The following discussion is derived from documentation for a prototypeconsolidation tool implemented by Microsoft® Corporation. Aspects of theprototype program, its usage, and/or its documentation are consistentwith or otherwise illustrate aspects of the embodiments describedherein. However, it will be understood that prototype documentationand/or implementation choices do not necessarily constrain the scope ofsuch embodiments, and likewise that the prototype and/or itsdocumentation may well contain features that lie outside the scope ofsuch embodiments. It will also be understood that the discussion belowis provided in part as an aid to readers who are not necessarily ofordinary skill in the art, and thus may contain and/or omit detailswhose recitation below is not strictly required to support the presentdisclosure.

The tool helps customer identify instances that can co-reside on aserver based on their CPU consumption. To identify instances to beconsolidated, the prototype starts with Microsoft® Assessment andPlanning toolkit (MAP) output, and merges it with user-providedcharacteristics of the instance. The prototype uses CPU Compute Units toestimate projected contributing load on the target server, andidentifies candidate instances that can coexist on the target server.MAP is an example of a profiler 130.

FIG. 4 illustrates a high level flow. A user executes 402 MAP or anotherprofiler tool 130. For each server type, the user also provides 404 aCompute Unit 310, based for example on spec dot org SPEC CPU 2006results or some other benchmarks. For each instance 208, the user alsoannotates 406 the instance with a degree of eligibility (a.k.a.isolation criterion 214) for consolidation, based for example onorganizational and technical considerations. The user executes the tool202 by commanding 328 it to apply the eligibility information to theinstance and performance data, and gets 360 in response a consolidationsuggestion 362 from the tool. The user evaluates 408 the results, whichmay include an enhanced assignment 232 or less desirable results, andselectively deploys 410 the suggestion by relocating instances. Thisdeployment provides additional data, which allows the user to refine 412the isolation criteria 214, performance data 210, and other inputs 414.Refinement may be followed by repeated MAP execution 402, inputprovision 404, and/or annotation 406, and/or by other steps describedherein, although for clarity of illustration FIG. 4 only shows aniterative loop back to commanding step 328.

In some versions, the tool 202 takes information about CPU, disk space,I/O capacity, and memory as inputs, and provides instance consolidationsuggestions as output. For example, inputs 414 may include: machinespecification data such as total memory, CPU compute power capacity, andso on; utilization data such as CPU and memory utilization data;user-specified input such as business and technical factors; andspecifications of the target server types. Output suggestions 362 mayinclude information as to which source instances can co-exist on atarget (a.k.a. destination) server, the total number of target serversneeded, and the number of target server pools, for example.

One of the many possible examples of input is shown below:

CPU: Intel® Xeon® 3.0 GHz (marks of Intel Corporation)

Memory: 8 GB

Diskspace: 512 GB

Network Speed: 100M/S

Processor Time %: 10

Destination pool: P

In some versions, the tool 202 imports MAP output data (e.g., Microsoft®Excel® files), possibly after that data is edited by the user. In some,the user can edit tool output suggestions 362 and then re-import theedited output as input 414 for a new iteration; that is, the input andoutput formats are consistent with each other and compatible.

In some versions, if no target servers are specified, the tools defaultsto some value, e.g., a 16-core server.

Some versions maintain a Tracking Spreadsheet, namely, an on-goingjournal or a log, with tool 202 updates with values to provide lineage,run number, run time date and time, input and output sheet names, whoran the report, run duration, and so on.

As a Processing Phase example, assume the following:

Target Server Computer Unit (CU) is 200 as specified on SPEC CPU2006.

Source Server instance 1 (SSI 1) CU is 20 from SPEC CPU2006 and it is10% utilized (from MAP).

Source Server instance 2 (SSI 2) CU is 40 from SPEC CPU2006 and it is20% utilized (from MAP).

Processing normalizes the instances CPU utilization, then computesNormalized CUs (NCUs) as follows.

Target Server NCU 100. The Normalization Factor is 0.5 (100/200=0.5).

SS I 1 is NCU 10 (20×0.5) and its load contribution is 1 (10×10%) if itwere to execute on the Target Server.

SS I 2 is NCU 20 (40×0.5) and its load contribution is 4 (20×20%) if itwere to execute on the Target Server.

Assuming 60% as the goal set by the installation, 12 such sets (11 and12) can be hosted on the Target Server, i.e., 24 instances.

The selection of the specific instances which add up to 60% utilizationis guided by the Organizational and Technical attribute values(isolation criteria 214) assigned by the installation.

An Output Phase identifies blocks of instances that are candidates forevaluation and consolidation on various Target Servers, producing asoutput a spreadsheet in the format and content that is usable by theinstallation as the input for the next run of the tool. This version ofthe tool adds the appropriate entries in the Tracking Spreadsheet forthe run (tracking, lineage).

The following observations are also provided, subject to the samecaveats as the discussion above.

In some versions, instead of relying on manual calculations a user canuse a tool which is implemented based on the model discussed herein toprovide the recommended solution, starting from performance gathering.Performance data gathering can be performed by a profiler such as MAP(Microsoft® Assessment and planning toolkit). This profiler toolaccesses a customers' infrastructure environment and gathers performancedata of database instances from the running candidate machines 128,including CPU utilization, memory utilization, I/O throughput, andnetwork I/O throughput. The step of gathering data may last severalweeks or months.

Secondly, gathered information standardizing occurs. All gathered majorresource information from different types of candidate servers will benormalized into standard units of this kind of resource, and thehardware configuration of target servers will be normalized intostandard units as well. Referring to the data gathered from thepractical environment, there are some formulas from practical experienceof Microsoft® SQL Server® instance consolidation (marks of MicrosoftCorporation) as follows:

Candidate's Needed Compute Unit=(Normalized CPU capacity)*ProcessorTime%.

Candidate's Needed Compute Unit in VM scenario=(ComputeUnit)*ProcessorTime %*(1+10%).

Candidate's Needed Memory=Data from information gathering tool (e.g.,MAP).

As to the Virtual Machine's Compute Unit: If the VM's Number of virtualprocessors<=Number of processors on the physical machine, then VM'sCU=(Physical machine's total CU)/(Number of processors)*(Number ofvirtual processors). Otherwise, VM's CU=Physical machine's total CU.

Virtual Machine's Memory=((start up+max)/2+max)/2, where start up/maxrefers to the start up/maximum memory allocated to the VM).

Target Server's Total Compute Unit=(Compute Power)*(MaximumUtilization)*(Number of Processors).

Thirdly, algorithmic category selection occurs. In this model, analgorithmic category will automatically be chosen based on the datacenter consolidation goals specified by the user in the user interface,which leads to the optimal solution subject to other conditions.

One data center goal. A single data center goal, also sometimes calledinstance consolidation, means that all the database instances can bemerged together without consideration of isolations from each other.Assuming the instance S1, S2 . . . Sn are to be merged to the targetserver T (with capacity C), a problem is how to pick the instances tomaximize the usage of the Target Server. That is, one seeks to minimizethe cost function:

C−Σ _(k=1) ^(k=n) S _(k)  (1)

In the cost function (1), S_(k) is the capacity of the instances, and 1to n is the numeric range of instances which are picked up. Minimizingthe cost function indicates that the Target Server is maximally used.

In some versions, the problem is transformed into a 0-1 knapsack problem228, and the code 206 flow shown in FIG. 6 is performed. If the tool isgiven multiple target servers, then descending sorting by capacity ofavailable target servers is performed to get a target server array P[ ].By considering the array element in the same sequence as an array indexto pick up the candidate, for each current element, one obtains another0-1 knapsack problem. Considering a larger target server to have ahigher priority and combining with the algorithm for 0-1 knapsackproblem solution helps ensure that a minimum number of target servers isused and that each target server is maximally used.

Multiple data centers goal. A multiple data center goal means thatmutual isolation of part or all of the database instances is consideredwhen merging instances to target servers. This model implicates one ormore of the following scenarios: considering security factors, somedatabase instances cannot co-reside at the same target server;considering organizational factors, some instances must be located inspecified data centers; considering compatibility factors, it will notbe suggested that some instances be located at the same virtual machineor physical server or pool.

Isolation factor(s) 216 can be used to describe the isolation, in whichinstances are subject to mutual isolation because of technology orbusiness considerations, stated as factors. The calculation of a factor216 can be customized. In some cases it is expressed as (businessfactor)*(tech factor). Only the instances with the same isolation factorcan be consolidated into the same virtual machine; the instances with adefault isolation factor can be consolidated into any virtual machines.An extreme case is that all database instances need to be isolated eachother. This consolidation will become the VM (virtual machine)Consolidation, which is also the simplest consolidation mode.

Assume the instances S1, S2 . . . Sn are to be merged to the targetserver T (with capacity C), with instances picked to maximize the usageof the Target Servers. One version of code 206 operates as follows.

First, divide 332 the candidate instances into different sets accordingto isolation factor. For each instance set 226, use one virtual machine224 to hold it, thus one gets a virtual machine array expressed as V1,V2, . . . Vn.

Second, use a normalized standard to indicate resource usage 212 of eachvirtual machine set. As to the CPU usage, for instance, normalize thecompute capacity and percentage usage by an instance into compute units,then round up to the standard utilization.

Third, sort 338 the available physical servers in a descending order bycapacity to get a physical array P[ ]. Consider the array element in thesame sequence as an array index to pick up the candidate virtualmachine. For each current element, this again defines a 0-1 knapsackproblem, to make sure each target is maximally used.

Fourth, produce the solution meeting the specified goals.

FIG. 5 illustrates a high-level architecture present in someembodiments. A consolidation tool 202 in the model includes aPerformance Information (Data Gathering 502) portion and a ComputeEngine 504 portion. The Performance Data Gathering portion will gatherthe performance data 210 of major resources consumed by the candidatedatabase instances 208, such as CPU utilization, memory utilization, I/Othroughput, network throughput, and so on. The Compute Engine 504 willpick a specific consolidation suggestion algorithm based on the goalspecified by customers and compute a solution 230 (leading to anenhanced assignment 232) that is based on the goal specified by customerand the consuming data 210 collected. A refine and re-execute iterativeprocess can be used, as customers can adjust the isolation factors 216and resource pools 506 to reach the ultimate solution with somecompromises in factors the customer deems acceptable. Resource pools mayinclude cloud 508 machines and/or local machines 510.

FIG. 6 illustrates an implementation algorithm flow for one data center,transformed for solution as a 0-1 knapsack problem 228. Given the TargetServer can hold capacity C (package capacity), instance i will costweight[i] of capacity (weight). The value of instance (value[i]) is setequal to its cost (equal to weight[i]). The collection of instances forwhich the total cost is as large as possible, within the given Servercapacity C, shall be chosen because in this case, the utilization ofServer capacity has reached the maximum. The maximum value function canbe written as:

f(i,x)=max{f(i−1,x−weight[i])+value[i],f(i−1,x)}, for x>weight[i]

More generally, f(i, x) is defined as the maximum value that can beattained with weight less than or equal to x using items up to i.

An implementation algorithm for multiple data centers may flow asfollows:

Divide 332 the candidate instances into different sets according to theisolation factor(s).

Allocate a virtual machine 224 for each set and get the virtual machinearray V1, V2, . . . Vn (associate 348 sets with virtual machines).

Round up 336 to get the usage 212 of major resources for each virtualmachine, and get the capacity array C1, C2, . . . Cn

Sort 338 the physical servers (or the elements in the resource pool(s))according to their capacity 222 and get the sorted array P1, P2, . . .Pm. Consider the elements in array P[ ], the sequence is P1, P2, . . .PM, the same as their index. For each element, pick up the instanceswhich will maximize use of the server, thus transforming thisdetermination to the same problem addressed in FIG. 6.

Now consider an example illustrating the foregoing techniques. Only theCompute Unit of CPU is considered as a criterion for consolidation, butother resources can be processed in a similar way. The given placementgoal is to consolidate all the candidate database instances to targetservers. As to gathered performance data, the following table containsthe measured performance data of candidate instances that were collectedfrom a live enterprise environment. Note that only the instance with thesame isolation factor can be merged into one virtual machine. The columnof Compute Unit illustrates the standardized CPU usage of candidatedatabase instances. For convenience in table formatting, in all thetables “CPU” stands for “Processor”.

% Total Total CPU Memory Capacity Compute Isolation Compute ID Host NameTime (MB) (GB) Power Factor Unit 1 CE4-05H- 2.31 9,583 15 14.7 1 0.33957LEGACY.Fabrikam.COM 2 CE4-05H- 4.47 3,583 20 44.8 2 2.00256NT.Fabrikam.COM 3 CE4P-3E32-R2- 1.17 10,056 25 127.8 5 1.495261.Fabrikam.COM 4 CE4P-3E32-R2- 1.28 12,354 35 25.2 2 0.322562.Fabrikam.COM 5 CE4P-3E64-R2- 7.28 32,765 30 18.9 3 1.375921.Fabrikam.COM 6 CE4P-3E64-R2- 3.42 16,381 45 14.6 4 0.499322.Fabrikam.COM 7 CE4P-3EIA64- 2.36 32,765 60 13.2 1 0.3115201.Fabrikam.COM 8 CE4P-8EIA64- 1.10 32,765 599 113.8 7 1.2518001.Fabrikam.COM 9 CE4P-8EIA64- 4.76 3,839 599 52.0 10 2.4752001.Fabrikam.COM 10 CE4P-XP32-SP3- 4.81 3,871 68 21.8 14 1.000481.Fabrikam.COM 11 CE4P-XP32-SP3- 20.48 4,031 398 10.0 18 2.048002.Fabrikam.COM 12 CE4P-XP64-SP3- 1.27 2,047 58 23.9 19 0.303531.Fabrikam.COM 13 CE4P-XP64-SP3- 2.71 2,039 48 23.9 20 0.647692.Fabrikam.COM 14 CE4V-3E32- 1.85 3,806 329 131.7 15 2.43645DE.Fabrikam.COM 15 CE4V-3E32- 4.13 3,838 329 31.7 2 1.30921JA.Fabrikam.COM 16 CE4V-3E32- 1.94 4,030 68 83.6 16 1.62184KO.Fabrikam.COM 17 CE4V-3E32-PT- 5.03 4,030 428 32.8 12 1.64984BR.Fabrikam.COM 18 CE4V-3E32-R2- 1.21 4,030 98 131.7 8 1.593571.Fabrikam.COM 19 CE4V3E32R2S2- 2.40 4,030 50 62.5 13 1.500001.Fabrikam.COM 20 CE4V3E32R2S2- 2.01 3,051 359 31.7 11 0.637172.Fabrikam.COM 21 CE4V-3E32-RTM- 1.49 3,051 359 72.3 9 1.077271.Fabrikam.COM 22 CE4V-3E32-SP1- 7.06 3,566 68 14.3 12 1.009581.Fabrikam.COM 23 CE4V-3E32-SP1- 1.05 3,566 418 131.7 3 1.382852.Fabrikam.COM 24 CE4V-3E32-SP2- 3.34 3,566 348 51.7 18 1.726781.Fabrikam.COM 25 CE4V-3E64-R2- 6.55 3,566 312 41.8 18 2.737901.Fabrikam.COM 26 CE4V-3E64-R2- 1.52 1,982 349 60.8 9 0.924162.Fabrikam.COM 27 CE4V3E64R2S2- 1.07 1,982 349 90.2 3 0.965141.Fabrikam.COM 28 CE4V3E64R2S2- 2.25 4,014 68 23.9 18 0.537752.Fabrikam.COM 29 CE4V3E64R2S2- 1.69 4,014 868 23.1 7 0.390393.Fabrikam.COM 30 CE4V-3S32-R2- 1.97 511 320 10.7 13 0.210791.Fabrikam.COM 32 CE4V3S32R2S2- 3.55 511 799 9.6 12 1.100162.Fabrikam.COM 33 CE4V-3S32-RTM- 1.11 511 68 131.7 17 1.461871.Fabrikam.COM 34 CE4V-3S32-SP1- 15.51 511 68 10.7 6 1.659573.Fabrikam.COM

As to target servers and configuration, the following table shows theavailable physical target servers in this example. The computingcapacity of a target server is given by the product of its ComputePower, Maximum Utilization and Number of Processors. The sum of computeunit of the instances consolidated to the target server should not begreater than the capacity of target server. Note that the MaximumUtilization is limited to reserve a buffer against a scenario when allthe instances consolidated reach their peaks at the same time. Note thateach virtual machine will have an over-head cost itself.

CPU Maximum Speed # of # of Utilization Compute Name Model (GHz) CPUsCores (%) Power target1 HP Integrity 1.6 1 32 60 36.7 rx8640 (1.6 GHz/24MB Dual-Core Intel Itanium 2) target2 Intel Core(TM) 2.7 1 32 60 30.2 i7CPU 920 @ 2.67 GHz, 64 bit target3 Intel 2.67 1 32 60 21.3 Core(TM)2 DuoCPU E6750 @ 2.66 GHz, 32 bit

A recommended solution using an additive linear model is shown in thefollowing table. As illustrated, the result of a consolidation solutionbased on an additive linear model in this example will use all threetarget servers and the over-all compute unit cost is 52.90.

Consolidation Virtual Isolation Compute Recommendation Machine Host NameFactor Unit target1 V1 CE4-05H-LEGACY.Fabrikam.COM 1 0.65109CE4-05H-LEGACY.Fabrikam.COM V2 CE4-05H-NT.Fabrikam.COM 2 3.63433CE4P-3E32-R2-2.Fabrikam.COM CE4V-3E32-JA.Fabrikam.COM V3CE4P-3E64-R2-1.Fabrikam.COM 3 3.72391 CE4V-3E32-SP1-2.Fabrikam.COMCE4V3E64R2S2-1.Fabrikam.COM V4 CE4P-3E64-R2-2.Fabrikam.COM 4 0.49932 V5CE4P-3E32-R2-1.Fabrikam.COM 5 1.49526 V6 CE4V-3S32-SP1-3.Fabrikam.COM 61.65957 V7 CE4P-8EIA64-01.Fabrikam.COM 7 1.64219CE4V3E64R2S2-3.Fabrikam.COM V8 CE4V-3E32-R2-1.Fabrikam.COM 8 1.59357 V9CE4V-3E32-RTM-1.Fabrikam.COM 9 2.00143 CE4V-3E64-R2-2.Fabrikam.COM V10CE4P-8EIA64-01.Fabrikam.COM 10 2.4752 V11 CE4V3E32R2S2-2.Fabrikam.COM 110.63717 target2 V12 CE4V-3E32-PT-BR.Fabrikam.COM 12 3.75958CE4V-3E32-SP1-1.Fabrikam.COM CE4V3S32R2S2-2.Fabrikam.COM V13CE4V3E32R2S2-1.Fabrikam.COM 13 1.71079 CE4V-3S32-R2-1.Fabrikam.COM V14CE4P-XP32-SP3-1.Fabrikam.COM 14 1.00048 V15 CE4V-3E32-DE.Fabrikam.COM 152.43645 V16 CE4V-3E32-KO.Fabrikam.COM 16 1.62184 V17CE4V-3S32-RTM-1.Fabrikam.COM 17 1.46187 target3 V18CE4P-XP32-SP3-2.Fabrikam.COM 18 7.05043 CE4V-3E32-SP2-1.Fabrikam.COMCE4V-3E64-R2-1.Fabrikam.COM CE4V3E64R2S2-2.Fabrikam.COM V19CE4P-XP64-SP3-1.Fabrikam.COM 19 0.30353

By contrast, a recommended solution using the placement-goal-based modeland approach described herein is shown in the following table. Asillustrated in this example, the result of consolidation based on thepresent model will use only two target servers and the over-all computeunit cost is 40.12, qualifying the result as an enhanced assignment 232.

Consolidation Virtual Isolation Compute Recommendation Machine Host NameFactor Unit target1 V1 CE4-05H-LEGACY.Fabrikam.COM 1 0.65109CE4-05H-LEGACY.Fabrikam.COM V2 CE4-05H-NT.Fabrikam.COM 2 3.63433CE4P-3E32-R2-2.Fabrikam.COM CE4V-3E32-JA.Fabrikam.COM V3CE4P-3E64-R2-1.Fabrikam.COM 3 3.72391 CE4V-3E32-SP1-2.Fabrikam.COMCE4V3E64R2S2-1.Fabrikam.COM V4 CE4P-3E64-R2-2.Fabrikam.COM 4 0.49932 V5CE4P-3E32-R2-1.Fabrikam.COM 5 1.49526 V12 CE4V-3E32-PT-BR.Fabrikam.COM12 3.75958 CE4V-3E32-SP1-1.Fabrikam.COM CE4V3S32R2S2-2.Fabrikam.COM V13CE4V3E32R2S2-1.Fabrikam.COM 13 1.71079 CE4V-3S32-R2-1.Fabrikam.COM V14CE4P-XP32-SP3-1.Fabrikam.COM 14 1.00048 V15 CE4V-3E32-DE.Fabrikam.COM 152.43645 V16 CE4V-3E32-KO.Fabrikam.COM 16 1.62184 V17CE4V-3S32-RTM-1.Fabrikam.COM 17 1.46187 target2 V6CE4V-3S32-SP1-3.Fabrikam.COM 6 1.65957 V7 CE4P-8EIA64-01.Fabrikam.COM 71.64219 CE4V3E64R2S2-3.Fabrikam.COM V8 CE4V-3E32-R2-1.Fabrikam.COM 81.59357 V9 CE4V-3E32-RTM-1.Fabrikam.COM 9 2.00143CE4V-3E64-R2-2.Fabrikam.COM v10 CE4P-8EIA64-01.Fabrikam.COM 10 2.4752V11 CE4V3E32R2S2-2.Fabrikam.COM 11 0.63717 V18CE4P-XP32-SP3-2.Fabrikam.COM 18 7.05043 CE4V-3E32-SP2-1.Fabrikam.COMCE4V-3E64-R2-1.Fabrikam.COM CE4V3E64R2S2-2.Fabrikam.COM V19CE4P-XP64-SP3-1.Fabrikam.COM 19 0.30353 V20 CE4P-XP64-SP3-2.Fabrikam.COM20 0.64769

Thus, a solution using an implementation algorithm based on theembodiments' model will use only two target servers while the presentsolution based on a linear-additive algorithm will use three targetservers. A benefit factor of the present model's approach can becalculated as

$\frac{C_{additive} - C_{present}}{C_{additive}} = {\frac{52.90 - 40.12}{52.90} = {24.16\%}}$

That is, 24.16% of server compute unit cost is saved by applying thealgorithm provided by this present model.

CONCLUSION

Although particular embodiments are expressly illustrated and describedherein as processes, as configured media, or as systems, it will beappreciated that discussion of one type of embodiment also generallyextends to other embodiment types. For instance, the descriptions ofprocesses in connection with FIGS. 3 through 6 also help describeconfigured media, and help describe the operation of systems andmanufactures like those discussed in connection with other Figures. Itdoes not follow that limitations from one embodiment are necessarilyread into another. In particular, processes are not necessarily limitedto the data structures and arrangements presented while discussingsystems or manufactures such as configured memories.

Not every item shown in the Figures need be present in every embodiment.Conversely, an embodiment may contain item(s) not shown expressly in theFigures. Although some possibilities are illustrated here in text anddrawings by specific examples, embodiments may depart from theseexamples. For instance, specific features of an example may be omitted,renamed, grouped differently, repeated, instantiated in hardware and/orsoftware differently, or be a mix of features appearing in two or moreof the examples. Functionality shown at one location may also beprovided at a different location in some embodiments.

Reference has been made to the figures throughout by reference numerals.Any apparent inconsistencies in the phrasing associated with a givenreference numeral, in the figures or in the text, should be understoodas simply broadening the scope of what is referenced by that numeral.

As used herein, terms such as “a” and “the” are inclusive of one or moreof the indicated item or step. In particular, in the claims a referenceto an item generally means at least one such item is present and areference to a step means at least one instance of the step isperformed.

Headings are for convenience only; information on a given topic may befound outside the section whose heading indicates that topic.

All claims and the abstract, as filed, are part of the specification.

While exemplary embodiments have been shown in the drawings anddescribed above, it will be apparent to those of ordinary skill in theart that numerous modifications can be made without departing from theprinciples and concepts set forth in the claims, and that suchmodifications need not encompass an entire abstract concept. Althoughthe subject matter is described in language specific to structuralfeatures and/or procedural acts, it is to be understood that the subjectmatter defined in the appended claims is not necessarily limited to thespecific features or acts described above the claims. It is notnecessary for every means or aspect identified in a given definition orexample to be present or to be utilized in every embodiment. Rather, thespecific features and acts described are disclosed as examples forconsideration when implementing the claims.

All changes which fall short of enveloping an entire abstract idea butcome within the meaning and range of equivalency of the claims are to beembraced within their scope to the full extent permitted by law.

1. A computer-readable non-transitory storage medium configured withdata and with instructions that when executed by at least one processorcauses the processor(s) to perform a process for facilitating databaseinstance consolidation, the process comprising the steps of: obtainingstandardized database instance performance data for database instancesrunning on source machines; receiving at least one database instanceisolation criterion; applying at least one received database isolationcriterion to automatically divide database instances into instance sets;determining a resource usage for each instance set; and automaticallyassigning instance sets to target machines based on instance setresource usage and target machine resource capacity, and utilizing atleast one of the following: dynamic programming, combinatorialoptimization.
 2. The configured medium of claim 1, wherein at least oneof the following is received as a database instance isolation criterion:a security isolation criterion indicating that specified instances shallnot co-reside on a target machine; an organizational isolation criterionindicating that specified instances shall be located together in asingle data center.
 3. The configured medium of claim 1, whereindetermining a resource usage for each instance set comprises rounding upto a multiple of a predetermined utilization unit.
 4. The configuredmedium of claim 1, wherein assigning instance sets to target machinescomprises sorting target machines by resource capacity.
 5. Theconfigured medium of claim 1, wherein the determining step utilizesstandardized performance data.
 6. The configured medium of claim 1,wherein the process further comprises associating each instance set witha virtual machine, and assigning instance sets includes assigningvirtual machines to target machines.
 7. The configured medium of claim6, wherein determining a resource usage for each instance set comprisesfinding a virtual machine resource usage for each virtual machine. 8.The configured medium of claim 1, wherein assigning instance sets totarget machines comprises solving a 0-1 knapsack problem.
 9. A processfor placement goal-based database instance consolidation, the processcomprising the steps of: gathering database instance performance datafor database instances running on source machines; standardizinggathered performance data; entering into a user interface of aconsolidation tool at least one database instance placement goal in theform of at least one isolation criterion; identifying target machinecharacteristics to the consolidation tool; commanding the consolidationtool to apply one or more database isolation criteria to thestandardized performance data and the target machine characteristics;and getting from the consolidation tool an enhanced assignment ofinstances to target machines, namely, an assignment which is moreresource efficient than an additive linear assignment.
 10. The processof claim 9, wherein standardizing gathered performance data includes atleast one of the following: setting a Needed Compute Unit to aNormalized CPU Capacity times a Processor Time Percentage; settingNeeded Compute Unit to a Normalized CPU Capacity times a Processor TimePercentage times a multiplier which exceeds one; setting a VirtualMachine Compute Unit to a Target Machine Compute Unit divided by aTarget Machine Number of Processors and times a Virtual Machine Numberof Processors, when Virtual Machine Number of Processors does not exceedTarget Machine Number of Processors; setting a Virtual Machine ComputeUnit to a Target Machine Compute Unit when a Virtual Machine Number ofProcessors exceeds a Target Machine Number of Processors; setting aVirtual Machine Memory Usage based on a Virtual Machine Startup MemoryAllocation and a Virtual Machine Maximum Memory Allocation.
 11. Theprocess of claim 9, wherein the entering step comprises entering atleast one isolation criterion into a spreadsheet program, and thespreadsheet program serves as at least a portion of the user interfaceof the consolidation tool.
 12. The process of claim 9, wherein thegetting step gets an assignment of instances for at least one of thefollowing situations: source machines are treated as being located inmultiple data centers and target machines are treated as being locatedin multiple data centers; source machines are treated as being locatedin multiple data centers and target machines are treated as beinglocated in a single data center; source machines are treated as beinglocated in a single data center and target machines are treated as beinglocated in multiple data centers; source machines are treated as beinglocated in a single data center and target machines are treated as beinglocated in a single data center.
 13. The process of claim 9, wherein theentering step comprises entering at least one isolation criterion whichis based on at least one of the following: a Security Factor, anOrganizational Factor, a Compatibility Factor.
 14. The process of claim9, wherein the entering step comprises entering a security isolationcriterion which indicates that specified instances shall not co-resideon a target machine.
 15. The process of claim 9, wherein the enteringstep comprises entering an organizational isolation criterion whichindicates that specified instances shall be located together in a singledata center.
 16. A computer system configured to assist databaseinstance consolidation, the system comprising: a logical processor; amemory in operable communication with the logical processor; at leastone database instance isolation criterion residing in the memory; anddatabase instance consolidation code residing in the memory and capableof automatically applying the database isolation criterion to dividedatabase instances into instance sets and capable of automaticallyassigning instance sets to target machines by dynamic programming basedon instance set resource usage and target machine resource capacity. 17.The system of claim 16, wherein the system is further characterized bystandardized database instance performance data residing in the memory,and the database instance consolidation code is also capable ofdetermining a resource usage for each instance set based on theperformance data.
 18. The system of claim 16, wherein the databaseinstance consolidation code comprises a spreadsheet program which isprogrammed to automatically assign instance sets to target machinesbased on instance set resource usage and target machine resourcecapacity.
 19. The system of claim 16, wherein the database instanceconsolidation code is programmed to assign instance sets to targetmachines based at least in part on a solution of a 0-1 knapsack problemarising at least in part from the instance sets.
 20. The system of claim16, further characterized in that an enhanced assignment of instances totarget machines resides in the memory, namely, an assignment which ismore resource efficient than an additive linear assignment.